The Bus-Driver Scheduling Problem
نویسندگان
چکیده
We present new metaheuristics for solving real crew scheduling problems in a public transportation bus company. Since the crews of these companies are drivers, we will designate the problem by the bus-driver scheduling problem. Crew scheduling problems are well known and several mathematical programming based techniques have been proposed to solve them, in particular using the set-covering formulation. However, in practice, there exists the need for improvement in terms of computational efficiency and capacity of solving large-scale instances. Moreover, the real bus-driver scheduling problems that we consider can present variant aspects of the set covering, as for example a different objective function, implying that alternative solution methods have to be developed. We propose metaheuristics based on the following approaches: GRASP (greedy randomized adaptive search procedure), tabu search and genetic algorithms. These metaheuristics also present some innovation features based on the structure of the crew scheduling problem, that guide the search efficiently and able them to find good solutions. Some of these new features can also be applied in the development of heuristics to other combinatorial optimization problems. A summary of computational results with real-data problems is presented.
منابع مشابه
Bus Driver Scheduling Problem using TLBO and JAYA Algorithm
Bus driver scheduling problem is one of most important and complex problem faced by many companies and bus terminals. This paper attempts to solve this problem using paramterless evolutionary algorithms, TLBO and JAYA algorithm. The objective of this paper is to assign the drivers to duty on a particular day and block duty by satisfying the constraints. Algorithms are tested on four randomly ge...
متن کاملBus Piece of Work Spell Relief
This paper reports on one of a number of parallel investigations being undertaken into alternative approaches to solving part or the whole of the bus driver scheduling problem. An arti cial ant system is set up, with ants following trails through a network, each trail representing a complete bus driver schedule. Initial schedules are set up by drawing from shifts generated by other systems avai...
متن کاملApplications of Information Technology for Bus and Driver Scheduling
Research in bus and driver scheduling at Leeds University has been taking advantage of new technologies since the early 1960s, with the objective of yielding better schedules more quickly. Here recent SERC supported work is presented. Most bus scheduling systems produce schedules for only one operating scenario. In practice, planning and scheduling are interconnected, and operators have to expl...
متن کاملSolving a Large Real-world Bus Driver Scheduling Problem with a Multi-assignment based Heuristic Algorithm
The bus driver scheduling problem (BDSP) under study consists in finding a set of duties that covers the bus schedule from a Brazilian public transportation bus company with the objective of minimizing the total cost. A deterministic 2-phase heuristic algorithm is proposed using multiple assignment problems that arise from a model based on a weighted multipartite graph. In the first phase, the ...
متن کامل